Algorithm for generating orthogonal matrices with rational elements
نویسنده
چکیده
Special orthogonal n × n matrices with rational elements form the group SO(n, Q), where Q is the field of rational numbers. A theorem describing the structure of an arbitrary matrix from this group is proved. This theorem yields an algorithm for generating such matrices by means of random number routines.
منابع مشابه
On the Central Coefficients of Riordan Matrices
We use the Lagrange-Bürmann inversion theorem to characterize the generating function of the central coefficients of the elements of the Riordan group of matrices. We apply this result to calculate the generating function of the central elements of a number of explicit Riordan arrays, defined by rational expressions, and in two cases we use the generating functions thus found to calculate the H...
متن کاملOn the Construction of Quasi-Binary and Quasi-Orthogonal Matrices over Finite Fields
Orthogonal and quasi-orthogonal matrices have a long history of use in digital image processing, digital and wireless communications, cryptography and many other areas of computer science and coding theory. The practical benefits of using orthogonal matrices come from the fact that the computation of inverse matrices is avoided, by simply using the transpose of the orthogonal matrix. In this pa...
متن کاملExplicit Matrices for Irreducible Representations of Weyl Groups
We present algorithms for constructing explicit matrices for every irreducible representation of a Weyl group, with particular emphasis on the exceptional groups. The algorithms we present will produce representing matrices in either of two forms: real orthogonal, with matrix entries that are square roots of rationals, or rational and seminormal. In both cases, the matrices are “hereditary” in ...
متن کاملHilbert Bases for Orthogonal Arrays
In this paper, we relate the problem of generating all 2-level orthogonal arrays of given dimension and force, i.e. elements in OA(n, m), where n is the number of factors and m the force, to the solution of an Integer Programming problem involving rational convex cones. We do not restrict the number of points in the array, i.e. we admit any number of replications. This problem can be theoretica...
متن کاملRational Gauss Quadrature
The existence of (standard) Gauss quadrature rules with respect to a nonnegative measure dμ with support on the real axis easily can be shown with the aid of orthogonal polynomials with respect to this measure. Efficient algorithms for computing the nodes and weights of an n-point Gauss rule use the n × n symmetric tridiagonal matrix determined by the recursion coefficients for the first n orth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.MS/0201007 شماره
صفحات -
تاریخ انتشار 2002